Robustness and Conditional Independence Ideals
نویسندگان
چکیده
We study notions of robustness of Markov kernels and probability distribution of a system that is described by n input random variables and one output random variable. Markov kernels can be expanded in a series of potentials that allow to describe the system’s behaviour after knockouts. Robustness imposes structural constraints on these potentials. Robustness of probability distributions is defined via conditional independence statements. These statements can be studied algebraically. The corresponding conditional independence ideals are generalized binomial edge ideals. The set of robust probability distributions lies on an algebraic variety. We compute a Gröbner basis of this ideal and study the irreducible decomposition of the variety. These algebraic results allow to parametrize the set of all robust probability distributions.
منابع مشابه
Max - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Robustness and Conditional Independence Ideals
We study notions of robustness of Markov kernels and probability distribution of a system that is described by n input random variables and one output random variable. Markov kernels can be expanded in a series of potentials that allow to describe the system’s behaviour after knockouts. Robustness imposes structural constraints on these potentials. Robustness of probability distributions is def...
متن کاملThe Binomial Ideal of the Intersection Axiom for Conditional Probabilities
The binomial ideal associated with the intersection axiom of conditional probability is shown to be radical and is expressed as an intersection of toric prime ideals. This resolves a conjecture in algebraic statistics due to Cartwright and Engström. Conditional independence contraints are a family of natural constraints on probability distributions, describing situations in which two random var...
متن کاملExperimentally comparing uncertain inference systems to probability
This paper examines the biases and performance of several uncertain inference systems: Mycin, a variant of Mycin. and a simplified version of probability using conditional independence assumptions. We present axiomatic arguments for using Minimum Cross Entropy inference as the best way to do uncertain inference. For Mycin and its variant we found special situations where its performance was ver...
متن کاملSome Properties of the Nil-Graphs of Ideals of Commutative Rings
Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices and are adjacent if and only if . Here, we study conditions under which is complete or bipartite. Also, the independence number of is deter...
متن کاملEfficient and Robust Independence-Based Markov Network Structure Discovery
In this paper we introduce a novel algorithm for the induction of the Markov network structure of a domain from the outcome of conditional independence tests on data. Such algorithms work by successively restricting the set of possible structures until there is only a single structure consistent with the conditional independence tests executed. Existing independence-based algorithms havewellkno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011